Edge ideals of clique clutters of comparability graphs and the normality of monomial ideals
نویسندگان
چکیده
منابع مشابه
Edge ideals of clique clutters of comparability graphs and the normality of monomial ideals
Let (P,≺) be a finite poset and let G be its comparability graph. If cl(G) is the clutter of maximal cliques of G, we prove that cl(G) satisfies the maxflow min-cut property and that its edge ideal is normally torsion free. We prove that edge ideals of complete admissible uniform clutters are normally torsion free. The normality of a monomial ideal is expressed in terms of blocking polyhedra an...
متن کاملMonomial Ideals and Planar Graphs
Ezra Miller and Bernd Sturmfels Department of Mathemati s, University of California, Berkeley CA 94720, USA enmiller math.berkeley.edu, bernd math.berkeley.edu Abstra t. Gr obner basis theory redu es questions about systems of polynomial equations to the ombinatorial study of monomial ideals, or stair ases. This arti le gives an elementary introdu tion to urrent resear h in this area. After re...
متن کاملCombinatorics of Symbolic Rees Algebras of Edge Ideals of Clutters
Let C be a clutter and let I be its edge ideal. We present a combinatorial description of the minimal generators of the symbolic Rees algebra Rs(I) of I . It is shown that the minimal generators of Rs(I) are in one to one correspondence with the irreducible parallelizations of C. From our description some major results on symbolic Rees algebras of perfect graphs and clutters will follow. As a b...
متن کاملBinomial Edge Ideals of Graphs
We characterize all graphs whose binomial edge ideals have a linear resolution. Indeed, we show that complete graphs are the only graphs with this property. We also compute some graded components of the first Betti number of the binomial edge ideal of a graph with respect to the graphical terms. Finally, we give an upper bound for the Castelnuovo-Mumford regularity of the binomial edge ideal of...
متن کاملMonomial Ideals
Monomial ideals form an important link between commutative algebra and combinatorics. In this chapter, we demonstrate how to implement algorithms in Macaulay 2 for studying and using monomial ideals. We illustrate these methods with examples from combinatorics, integer programming, and algebraic geometry.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: MATHEMATICA SCANDINAVICA
سال: 2010
ISSN: 1903-1807,0025-5521
DOI: 10.7146/math.scand.a-15126